×

setting of points造句

"setting of points"是什么意思   

例句与造句

  1. the set of points is called a level surface .
    这种点的集合被称为等位面。
  2. xy charts display data as a set of points in space
    xy图将数据显示为空间的一组点。
  3. line charts display data as a set of points connected by a line
    折线图将数据显示为一组由折线连接的点。
  4. enumeration represents a set of point properties that describe visual style elements
    枚举表示一组描述视觉样式元素的点属性。
  5. connected set of points
    连通点集
  6. It's difficult to find setting of points in a sentence. 用setting of points造句挺难的
  7. area charts display data as a set of points connected by a line, with a filled-in area below the line
    面积图将数据显示为一组由线条连接的点,线条以下为填充区域。
  8. in this set system, the set element named quorum is a set of points, and every two quorums intersect
    在这种集合系统中,所有集合元素(称为quorum)都是节点的集合,任何两个quorum都有交集。
  9. in the case of a tlu with an arbitrary number of inputs, n, the set of possible inputs corresponds to a set of points in n-dimensional space
    在tlu有任意数目的n个输入的情况下,一组可能的输入对应于n维空间中的一个点集。
  10. two-dimensional vector graphics are primitives; such as lines, curves, and figures; that are specified by sets of points on a coordinate system
    二维矢量图形为基元(例如,直线、曲线和图形);它们由坐标系统上的多组点指定。
  11. in order to prove i am alive, i write a simple algorithm to generate simple polygon from a set of points because i only think when i do coding
    身为科技外语系主任的刘教授终于想出一个他知道合适的英文单词,同时借机一仰脖又喝一杯。
  12. the study about geometric properties of finite sets of points in the plane is one of the most famous and fundamental topics in combinatorial geometry
    平面点集几何性质的研究是组合几何中的一个重要内容。本文讨论其中最为著名的erd(?)s问题。
  13. the euclidean 2-connected steiner network problem is to determine the minimum-weight 2-connected steiner network on a given set of points in the euclidean plane
    设p是欧几里德平面上的一个有限点集,n是顶点集为v,边集为e的一个网络,如果p
  14. in this paper we also present a procedure for automatically reconstructing a nurbs surface of arbitrary topological type from an unorganized set of points
    因此,针对具有任意拓扑形状的曲面,本文提出了从一组无序点自动重构具有任意拓扑结构nurbs曲面的方法。
  15. a good mesh generation algorithm should accept an arbitrary planar straight line graph and output a delaunay triangulation of a set of points which conforms to the input and has no small or large angles
    一个好的网格生成算法应当是对于任意的输入平面直线图生成点集的贴体的delaunay三角剖分并且没有较大或较小的角。
  16. 更多例句:  下一页
桌面版繁體版English日本語

Copyright © 2025 WordTech Co.

Last modified time:Tue, 12 Aug 2025 00:29:56 GMT